#include"sort.h"

void testInsertSort()
{
	int a[] = { 7,6,555,48,5,23,7,8,3 };
	InsertSort(a, sizeof(a) / sizeof(int));
	for (int i=0;i<(sizeof(a)/sizeof(int));i++)
	{
		printf("%d ", a[i]);
	}
}

void testShellSort()
{
	int a[] = { 7,6,555,48,5,23,7,8,3 };
	ShellSort(a, sizeof(a) / sizeof(int));
	for (int i = 0; i < (sizeof(a) / sizeof(int)); i++)
	{
		printf("%d ", a[i]);
	}
}

void testHeapSort()
{
	int a[] = { 7,6,555,48,5,23,7,8,3 };
	HeapSort(a, sizeof(a) / sizeof(int));
	for (int i = 0; i < (sizeof(a) / sizeof(int)); i++)
	{
		printf("%d ", a[i]);
	}
}

void testSelectSort()
{
	int a[] = { 7,6,555,48,5,23,7,8,3 };
	SelectSort(a, sizeof(a) / sizeof(int));
	for (int i = 0; i < (sizeof(a) / sizeof(int)); i++)
	{
		printf("%d ", a[i]);
	}
}


void testBubbleSort()
{
	int a[] = { 7,6,555,48,5,23,7,8,3 };
	BubbleSort(a,sizeof(a)/sizeof(int));
	for (int i = 0; i < (sizeof(a) / sizeof(int)); i++)
	{
		printf("%d ", a[i]);
	}
}

void testQuickSort()
{
	int a[] = { 7,6,555,48,5,23,7,8,3 };
	//int a[] = { 23,4,8,9,2,86,3,48 };
	//由于快排需要知道排序的范围，数组角标比长度小一
	QuickSort(a, 0, sizeof(a) / sizeof(int)-1);
	for (int i = 0; i < (sizeof(a) / sizeof(int)); i++)
	{
		printf("%d ", a[i]);
	}
}

void testMergeSort()
{
	int a[] = { 7,6,555,48,5,23,7,8,3 };
	MergeSort(a, sizeof(a) / sizeof(int));
	for (int i = 0; i < (sizeof(a) / sizeof(int)); i++)
	{
		printf("%d ", a[i]);
	}
}

void testMergeSortNonR()
{
	int a[] = { 7,6,555,48,5,23,7,8,3 };
	MergeSortNonR(a, sizeof(a) / sizeof(int));
	for (int i = 0; i < (sizeof(a) / sizeof(int)); i++)
	{
		printf("%d ", a[i]);
	}
}

void testCountSort()
{
	int a[] = { 7,6,555,48,5,23,7,8,3 };
	CountSort(a, sizeof(a) / sizeof(int));
	for (int i = 0; i < (sizeof(a) / sizeof(int)); i++)
	{
		printf("%d ", a[i]);
	}
}


void TestOP()
{
	srand(time(0));
	const int N = 1000000;
	int* a1 = (int*)malloc(sizeof(int) * N);
	int* a2 = (int*)malloc(sizeof(int) * N);
	int* a3 = (int*)malloc(sizeof(int) * N);
	int* a4 = (int*)malloc(sizeof(int) * N);
	int* a5 = (int*)malloc(sizeof(int) * N);
	int* a6 = (int*)malloc(sizeof(int) * N);
	int* a7 = (int*)malloc(sizeof(int) * N);
	int* a8 = (int*)malloc(sizeof(int) * N);
	int* a9 = (int*)malloc(sizeof(int) * N);

	int j = 0;
	for (int i = 0; i < N; ++i)
	{
		a1[i] = rand()+1;

		a2[i] = a1[i];
		a3[i] = a1[i];
		a4[i] = a1[i];
		a5[i] = a1[i];
		a6[i] = a1[i];
		a7[i] = a1[i];
		a8[i] = a1[i];
        a9[i] = a1[i];
	}
	printf("循环随机赋值完毕\n");

	int begin1 = clock();
	//InsertSort(a1, N);
	int end1 = clock();

	int begin2 = clock();
	ShellSort(a2, N);
	int end2 = clock();

	int begin3 = clock();
	//SelectSort(a3, N);
	int end3 = clock();

	int begin4 = clock();
	HeapSort(a4, N);
	int end4 = clock();

	int begin7 = clock();
	//BubbleSort(a7, N);
	int end7 = clock();

	int begin5 = clock();
	QuickSort(a5, 0, N - 1);
	int end5 = clock();

	int begin6 = clock();
	MergeSort(a6, N);
	int end6 = clock();

	int begin8 = clock();
	MergeSortNonR(a8, N);
	int end8 = clock();

    int begin9 = clock();
	CountSort(a9, N);
	int end9 = clock();

	printf("InsertSort:%d\n", end1 - begin1);
	printf("ShellSort:%d\n", end2 - begin2);
	printf("SelectSort:%d\n", end3 - begin3);
	printf("HeapSort:%d\n", end4 - begin4);
	printf("BubbleSort:%d\n", end7 - begin7);

	printf("QuickSort:%d\n", end5 - begin5);
	printf("MergeSort:%d\n", end6 - begin6);
	printf("MergeSortNonR:%d\n", end8 - begin8);
    printf("CountSort:%d\n", end9 - begin9);

	free(a1);
	free(a2);
	free(a3);
	free(a4);
	free(a5);
	free(a6);
	free(a7);
	free(a8);
    free(a9);
}

int main()
{
	//TestOP();
	//testInsertSort();
	//testShellSort();
	//testHeapSort();
	//testSelectSort();
	//testBubbleSort();
	//testQuickSort();
	testMergeSort();
	//testMergeSortNonR();
    //testCountSort();
	return 0;
}